Technologies for file sharing

ABSTRACT

This disclosure enables various computing technologies for sharing various files securely and selectively between various predefined user groups based on various predefined workflows. For each of the predefined workflows, the files are shared based on a data structure storing various document identifiers and various metadata tags, with the document identifiers mapping onto the metadata tags.

This patent application is a Continuation of U.S. patent applicationSer. No. 16/953,830 filed 20 Nov. 2020; which is a Continuation of U.S.patent application 16/501,110 filed 08 Jun.2018, now U.S. Pat. No.10,846,268 issued 24 Nov. 2020; each of which is incorporated byreference herein for all purposes.

TECHNICAL FIELD

This disclosure relates to file sharing.

BACKGROUND

Various network-based file sharing services, whether peer-to-peer (P2P)or cloud-based, enable users to share files with each other. Forexample, some of such services include Napster, BitTorrent, Dropbox,Box, Egnyte, Google Drive, Microsoft OneDrive, Microsoft SharePoint,Microsoft Teams, Slack, Apple iCloud, and others. Although theseservices are popular for use in many situations, there are somesituations when these services are inadequate. In particular, theseservices are unable to share various files securely and selectivelybetween various predefined user groups based on various predefinedworkflows. For example, in document onboarding situations, wheredocument permissioning is important for various workflow situations,most users end up searching multitudes of emails and file directories,whether local or cloud-based, for relevant documents, which islaborious, costly, insecure, and time-consuming.

SUMMARY

In an embodiment, there is provided a method comprising: serving, via aserver, a user interface to a first application running on a firstclient, wherein the user interface is configured to receive a firstentity identifier, a second entity identifier, an action identifier, anda selection of a file; receiving, via the server, the first entityidentifier, the second entity identifier, and the action identifier fromthe first application; receiving, via the server, a copy of the filebased on the selection; generating, via the server, a task identifier, adata structure, and a document identifier; grouping, via the server, thedata structure with the task identifier; populating, via the server, thedata structure with the document identifier, the first entityidentifier, the second entity identifier, and the action identifier suchthat the document identifier maps onto the first entity identifier, thesecond entity identifier, and the action identifier; hosting, via theserver, a session with a second application running on a second client,wherein the session is associated with the second entity identifier andthe action identifier; associating, via the server, the secondapplication with the task identifier during the session based on thesecond entity identifier associated with the session and the actionidentifier associated with the session matching the second entityidentifier in the data structure and the action identifier in the datastructure; and sharing, via the server, the copy with the secondapplication during the session based on the task identifier such thatthe copy is retrievable via the second application based on the documentidentifier in the data structure.

DESCRIPTION OF DRAWINGS

FIG. 1 shows a schematic diagram of an embodiment of a network topologyaccording to this disclosure.

FIG. 2 shows a schematic diagram of an embodiment of a data organizationaccording to this disclosure.

FIG. 3 shows a flowchart of an embodiment of a process for grantingaccess to a copied file according to this disclosure.

FIG. 4 shows a schematic diagram of an embodiment of a data structurestoring a document identifier and a plurality of tags according to thisdisclosure.

FIG. 5 shows a flowchart of an embodiment of a process for receivingaccess to a file according to this disclosure.

FIGS. 6A-6C show a flowchart and a pair of screenshots of an embodimentof a technique for tracking a progress against a set of rules based on afile associated with a plurality of item identifiers, a plurality ofcategory identifiers, and a plurality of type identifiers according tothis disclosure.

FIGS. 7A-7C show a flowchart and a pair of screenshots of an embodimentof a technique for updating a progress detail according to thisdisclosure.

FIG. 8 shows a flowchart of an embodiment of a process for appending toa blockchain according to this disclosure.

FIG. 9 shows a flowchart of an embodiment of a process for executing asmart contract based on a data structuring according to this disclosure.

FIG. 10 shows a flowchart of an embodiment of a process for reading adata structuring via an artificial intelligence (AI) process accordingto this disclosure.

FIG. 11 shows a flowchart of an embodiment of a process for a useraction with respect to a data structure based on a belonging to a usergroup according to this disclosure.

FIGS. 12-22 show a plurality of screenshots of an embodiment of a userinterface operating based on a data structure storing a mapping betweena document identifier and a plurality of tags according to thisdisclosure.

FIGS. 23A-23I show a plurality of screenshots of an embodiment of amulti-user sharing technique according to this disclosure.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Generally, this disclosure enables various computing technologies forsharing various files securely and selectively between variouspredefined user groups based on various predefined workflows. For eachof the predefined workflows, the files are shared based on a datastructure storing various document identifiers and various metadatatags, with the document identifiers mapping onto the metadata tags. Assuch, these computing technologies can be used in various situations,such as onboarding or others in many fields, such as finance,accounting, legal, law enforcement, military, intelligence, education,manufacturing, medicine, pre-trade client onboarding, or others. Thisdisclosure is now described more fully with reference to FIGS. 1-23I, inwhich some embodiments of this disclosure are shown. This disclosuremay, however, be embodied in many different forms and should not beconstrued as necessarily being limited to only embodiments disclosedherein. Rather, these embodiments are provided so that this disclosureis thorough and complete, and fully conveys various concepts of thisdisclosure to skilled artisans.

Note that various terminology used herein can imply direct or indirect,full or partial, temporary or permanent, action or inaction. Forexample, when an element is referred to as being “on,” “connected” or“coupled” to another element, then the element can be directly on,connected or coupled to the other element or intervening elements can bepresent, including indirect or direct variants. In contrast, when anelement is referred to as being “directly connected” or “directlycoupled” to another element, there are no intervening elements present.

Likewise, as used herein, a term “or” is intended to mean an inclusive“or” rather than an exclusive “or.” That is, unless specified otherwise,or clear from context, “X employs A or B” is intended to mean any of thenatural inclusive permutations. That is, if X employs A; X employs B; orX employs both A and B, then “X employs A or B” is satisfied under anyof the foregoing instances.

Similarly, as used herein, various singular forms “a,” “an” and “the”are intended to include various plural forms as well, unless contextclearly indicates otherwise. For example, a term “a” or “an” shall mean“one or more,” even though a phrase “one or more” is also used herein.

Moreover, terms “comprises,” “includes” or “comprising,” “including”when used in this specification, specify a presence of stated features,integers, steps, operations, elements, or components, but do notpreclude a presence and/or addition of one or more other features,integers, steps, operations, elements, components, or groups thereof.Furthermore, when this disclosure states that something is “based on”something else, then such statement refers to a basis which may be basedon one or more other things as well. In other words, unless expresslyindicated otherwise, as used herein “based on” inclusively means “basedat least in part on” or “based at least partially on.”

Additionally, although terms first, second, and others can be usedherein to describe various elements, components, regions, layers, orsections, these elements, components, regions, layers, or sectionsshould not necessarily be limited by such terms. Rather, these terms areused to distinguish one element, component, region, layer, or sectionfrom another element, component, region, layer, or section. As such, afirst element, component, region, layer, or section discussed belowcould be termed a second element, component, region, layer, or sectionwithout departing from this disclosure.

Also, unless otherwise defined, all terms (including technical andscientific terms) used herein have the same meaning as commonlyunderstood by one of ordinary skill in an art to which this disclosurebelongs. As such, terms, such as those defined in commonly useddictionaries, should be interpreted as having a meaning that isconsistent with their meaning in a context of a relevant art and shouldnot be interpreted in an idealized or overly formal sense unlessexpressly so defined herein.

FIG. 1 shows a schematic diagram of an embodiment of a network topologyaccording to this disclosure. In particular, a network topology 100 isimplemented in logic, whether hardware-based or software-based, on acomponent basis. For example, when the logic is hardware-based, thensuch logic can comprise circuitry, such as processors, memory, inputdevices, output devices, or other hardware, that is configured, such asvia programming or design, to implement a functionality of a respectivecomponent. Likewise, when the logic is software-based, then such logiccan comprise an instruction, such as an assembly code, a machine code,an object code, a source code, or any other type of instructions, whichwhen executed, such as via running or compilation, implement afunctionality of a respective component. Also, note that at least onecomponent of the network topology 100 can be implemented as a service.Moreover, note that at least two components of the network topology 100can be hosted on one computing system/hardware/device or each bedistinctly hosted.

The network topology 100 is based on a distributed network operationmodel which allocates tasks/workloads between servers, which provide aresource/service, and clients, which request the resource/service. Theservers and the clients illustrate different computers/applications, butin some embodiments, the servers and the clients reside in or are onesystem/device/framework/platform/application. Further, in someembodiments, the topology 100 entails allocating a large number ofresources to a small number of computers, where complexity of theclients depends on how much computation is offloaded to the small numberof computers, i.e., more computation offloaded from the clients onto theservers leads to lighter clients, such as being more reliant on networksources and less reliant on local computing resources. Note that othercomputing models are possible as well. For example, such models cancomprise decentralized computing, such as a P2P system, for instanceBitTorrent, or distributed computing, such as via a computer clusterwhere a set of networked computers works together such that the computercan be viewed as a single system.

The network topology 100 includes a network 102, a client 104, a client106, a server 110, and a database 146. The client 104 hosts an operatingsystem (OS) 112 and a browser 118 running on the OS 112. The client 106hosts an OS 114 and a browser 120 running on the OS 114. The server 110hosts an OS 116 and an application 122 running on the OS 116. Theapplication 122 hosts a blockchain logic 124, an interface logic 126, amessaging logic 128, an export logic 130, a storage logic 132, areporting logic 134, a metadata logic 136, a progress logic 138, aprivilege logic 138, a search logic 140, a permission logic 142, and anotification logic 144, any one of which can be a module, an object, aroutine, a script, a library, or others.

The network 102 includes a plurality of nodes, such as a collection ofcomputers or other hardware interconnected via a plurality ofcommunication channels, which allow for sharing of resources orinformation. Such interconnection can be direct or indirect. The network102 can be wired or wireless. The network 102 can allow forcommunication over short or long distances, whether encrypted orunencrypted. The network 102 can operate via at least one networkprotocol, such as Ethernet, a Transmission Control Protocol(TCP)/Internet Protocol (IP), and so forth. The network 102 can have anyscale, such as a personal area network (PAN), a local area network(LAN), a home area network, a storage area network (SAN), a campus areanetwork, a backbone network, a metropolitan area network, a wide areanetwork (WAN), an enterprise private network, a virtual private network(VPN), a virtual network, a satellite network, a computer cloud network,an internetwork, a cellular network, and so forth. The network 102 canbe or include an intranet or an extranet. The network 102 can be orinclude Internet. The network 102 can include other networks or allowfor communication with other networks, whether sub-networks or distinctnetworks, whether identical or different from the network 102 instructure or operation. The network 102 can include hardware, such as acomputer, a network interface card, a repeater, a hub, a bridge, aswitch, an extender, an antenna, or a firewall, whether hardware basedor software based. The network 102 can be operated, directly orindirectly, by or on behalf of an entity or an actor, irrespective ofany relation to any contents of this disclosure.

The clients 104, 106 can be embodied as a terminal, a kiosk, aworkstation, a vehicle, whether land, marine, or aerial, a desktop, alaptop, a tablet, a mobile phone, a mainframe, a supercomputer, a serverfarm, and so forth. The clients 104, 106 can include or be coupled to aninput device, such as a mouse, a keyboard, a camera, whetherforward-facing or back-facing, an accelerometer, a touchscreen, abiometric reader, a clicker, a microphone, or any other suitable inputdevice. The clients 104, 106 can include or be coupled to an outputdevice, such as a display, a speaker, a headphone, a joystick, aprinter, or any other suitable output device. In some embodiments, theinput device and the output device can be embodied in one unit, such asa touch-enabled display, which can be haptic. The OSs 112, 114 can beany type of an OS, such as MacOS, Windows, Android, Unix, Linux, orothers. The browsers 118, 120 can be any type of a browser, such asInternet Explorer, Mozilla Firefox, Google Chrome, Apple Safari,Microsoft Edge, Amazon Silk, or others. Note that the OSs 112, 114 canrun other applications, which can be used in accordance with thisdisclosure. Some examples of such applications include a productivityapplication, such as Microsoft Word, Microsoft Excel, Adobe Acrobat, orothers, a directory navigation application, such as Windows Explorer,MacOS Finder, a command prompt, or others, whether a directory is localto or remote from the OSs 112, 114. The clients 104, 106 are incommunication with the network 102, such as via the browsers 118, 120,or with the server 110 through the network 110, such as via the browsers118, 120. In some embodiments, the clients 104, 106 are in communicationwith the server 110 directly, thereby bypassing the network 102. Notethat more than two clients 104, 106 can be used as well, such as tens,hundreds, or thousands of clients or even more, whether identical to ordifferent from each other in hardware or software configuration.

The server 110 can be embodied as a terminal, a kiosk, a workstation, avehicle, whether land, marine, or aerial, a desktop, a laptop, a tablet,a mobile phone, a mainframe, a supercomputer, a server farm, and soforth. The server 110 can include or be coupled to an input device, suchas a mouse, a keyboard, a camera, whether forward-facing or back-facing,an accelerometer, a touchscreen, a biometric reader, a clicker, amicrophone, or any other suitable input device. The server 110 caninclude or be coupled to an output device, such as a display, a speaker,a headphone, a joystick, a printer, or any other suitable output device.In some embodiments, the input device and the output device can beembodied in one unit, such as a touch-enabled display, which can behaptic. The OS 116 can be any type of an OS, such as MacOS, Windows,Android, Unix, Linux, or others. The server 110 can be a single serveror a plurality of servers, such as the server 110 being distributedamong a web server, an application server, a database server, a virtualserver, or others.

The application 112 operates as instructed via the blockchain logic 124,the interface logic 126, the messaging logic 128, the export logic 130,the storage logic 132, the reporting logic 134, the metadata logic 136,the progress logic 138, the privilege logic 138, the search logic 140,the permission logic 142, and the notification logic 144. In someembodiments, at least one of the blockchain logic 124, the interfacelogic 126, the messaging logic 128, the export logic 130, the storagelogic 132, the reporting logic 134, the metadata logic 136, the progresslogic 138, the privilege logic 138, the search logic 140, the permissionlogic 142, or the notification logic 144 is external to at least one ofthe application 112, the OS 116, or the server 110. Moreover, at leasttwo of the blockchain logic 124, the interface logic 126, the messaginglogic 128, the export logic 130, the storage logic 132, the reportinglogic 134, the metadata logic 136, the progress logic 138, the privilegelogic 138, the search logic 140, the permission logic 142, and thenotification logic 144 can be a single logic. Further, note thatalthough the application 112 is modular with respect to the blockchainlogic 124, the interface logic 126, the messaging logic 128, the exportlogic 130, the storage logic 132, the reporting logic 134, the metadatalogic 136, the progress logic 138, the privilege logic 138, the searchlogic 140, the permission logic 142, and the notification logic 144, theapplication 112 can be non-modular, such as objected oriented,monolithic, or others.

The database 146 is hosted off the server 110. In some embodiments, theserver 110 hosts the database 146, whether internal to the application122 or external to the application 122, such as via the OS 116. Thedatabase 146 is configured for various database operations, such ascreating records, modifying records, retrieving records, searchingrecords, identifying records, deleting records, sorting records, orothers, in whole or in part. For example, some of various database input(I)/output (O) operations include reading, writing, editing, deleting,updating, searching, selecting, merging, sorting, erasing, formatting,or others. The database 146 stores data, whether in a raw state, aformatted state, an organized stated, or any other accessible state, andallows access to such data, whether directly and/or indirectly. Thedatabase 146 can be a single database or a plurality of databases,whether hosted on a single machine or a plurality of machines, whetherin a single data center or distributed among a plurality of datacenters. The database 146 can comprise at least one of a relationaldatabase, a non-relational database, a post-relational database, anin-memory database, a hybrid database, an Extensible Markup Language(XML) database, a parallel database, a distributed database, a graphdatabase, a mobile database, an operation database, a probabilisticdatabase, a real-time database, a spatial database, a temporal database,an object-oriented database, an unstructured data database, aterminology oriented database, or others.

In one mode of operation, as further explained below, the network 100topology is configured to perform a technique for sharing various filessecurely and selectively between various predefined user groups based onvarious predefined workflows. For each of the predefined workflows, thefiles are shared based on a data structure storing various documentidentifiers and various metadata tags, with the document identifiersmapping onto the metadata tags.

FIG. 2 shows a schematic diagram of an embodiment of a data organizationaccording to this disclosure. In order to share various files securelyand selectively between various predefined user groups based on variouspredefined workflows, as further described below, the application 122maintains or operates based on a data organization in accordance with aschema 200. In particular, the schema 200 includes an entity identifier202, an action identifier 204, an item identifier 206, a categoryidentifier 208, a type identifier 210, a task identifier 212, and adocument identifier 214. Each of the entity identifier 202, the actionidentifier 204, the item identifier 206, the category identifier 208,the type identifier 210, the task identifier 212, and the documentidentifier 214 includes a set, a sequence, a term, a collection, agroup, a string, or other informational unit of alphabetic, numeric,alphanumeric, glyphic, barcode, pictorial symbols or marks or any otherinformational form in any other organizational arrangement. Note thatpunctuation symbols or marks can be included. Each of the entityidentifier 202, the action identifier 204, the item identifier 206, thecategory identifier 208, the type identifier 210, the task identifier212, and the document identifier 214 can be generated in accordance witha predefined format, such as an International Standards Organization(ISO) format or others, or a combination of formats, such a plurality ofISO formats, or randomly generated. Each of the entity identifier 202,the action identifier 204, the item identifier 206, the categoryidentifier 208, the type identifier 210, the task identifier 212, andthe document identifier 214 can be unique with respect to theapplication 122, with respect to each other, or with respect to thatparticular identifier collection or identifier type or identifierformat.

The schema 200 includes a logical format as indicated by a plurality oflines between the entity identifier 202, the action identifier 204, theitem identifier 206, the category identifier 208, the type identifier210, the task identifier 212, and the document identifier 214. Inparticular, according to the logical format, the entity identifier 202is hierarchically related to the action identifier 204 such that theentity identifier 202 is in a one-to-many correspondence with the actionidentifier 204. For example, the entity identifier 202 canhierarchically have many action identifiers 204. Further, according tothe logical format, the action identifier 204 is hierarchically relatedto the item identifier 206 such that the action identifier 204 is in aone-to-many correspondence with the item identifier 206. For example,the action identifier 204 can hierarchically have many item identifiers206. Moreover, according to the logical format, the item identifier 206is hierarchically related to the category identifier 208 such that theitem identifier 206 is in a one-to-many correspondence with the categoryidentifier 208. For example, the item identifier 206 can hierarchicallyhave many category identifiers 208. Additionally, according to thelogical format, the category identifier 208 is hierarchically related tothe type identifier 210 such that the category identifier 208 is in aone-to-many correspondence with the type identifier 210. For example,the category identifier 208 can hierarchically have many typeidentifiers 210.

Collectively, according to the logical format, the entity identifier202, the action identifier 204, and the item identifier 206 are groupedwith the task identifier 212 such the task identifier 212 is in aone-to-many correspondence with each of the entity identifier 202, theaction identifier 204, and the item identifier 206. For example, thetask identifier 212 can be grouped with many entity identifiers 202,many action identifiers 204, and many item identifiers 206. In someembodiments, the task identifier 212 can be grouped with at least one ofthe category identifier 208 or the type identifier 210 in a one-to-manycorrespondence. For example, the task identifier 212 can be grouped withmany category identifiers 208 or many type identifiers 210. Moreover,collectively, according to the logical format, the entity identifier202, the action identifier 204, the item identifier 206, the categoryidentifier 208, and the type identifier 210 are grouped with thedocument identifier 214 such that the document identifier 214 is in aone-to-many correspondence with each of the entity identifier 202, theaction identifier 204, the item identifier 206, the category identifier208, and the type identifier 210. For example, the document identifier214 can be grouped with many entity identifiers 202, many actionidentifiers 204, many item identifiers 206, many category identifiers208, and many type identifiers 210. Also, collectively, according to thelogical format, the task identifier 212 is grouped with the documentidentifier 214 in a one-to-many correspondence. For example, the taskidentifier 212 can be grouped with many document identifiers 214.

The entity identifier 202 corresponds to a group of users operating theclients 104, 106. For example, the entity identifier 202 can correspondto a group containing a user A and a user B, where the user Acorresponds to the client 104 and the user B corresponds to the client106. Therefore, the privilege logic 138 enables the application 122 todistinguish between various groups of users based on the entityidentifier 202. For example, if the entity identifier 202 corresponds anorganization, then various employees of that organization who operatethe clients 104, 106 are a group of users. For example, the entityidentifier can include a legal entity identifier (LEI), such as definedvia an ISO standard 17442 where the LEI includes a 20-characteralphanumeric string, with a sequence of first four charactersidentifying a Local Operating Unit (LOU) that issued the LEI, charactersfive and six are reserved as ‘00’, characters seven-eighteen are aunique alphanumeric string assigned to an entity by the LOU, and finaltwo characters are checksum digits.

The action identifier 204 corresponds to an action that is associatedwith the entity identifier 202. The action identifier 204 can bedependent on or hard coded to depend on the entity identifier 202 asinput. For example, in context of finance, the action identifier 204 canbe a new fund launch or NFL or others. Therefore, if the entityidentifier 202 includes an LEI, then the action identifier 204 caninclude a string NFL, where the entity identifier 202 corresponds to theaction identifier 204 in a one-to-many correspondence.

The item identifier 206 corresponds to an item that is associated withthe action identifier 204. The item identifier 206 can be dependent onor hard coded to depend on the action identifier 204 as input. Forexample, in context of finance, the item identifier 206 can be a fundidentifier or fund ID or FID or others. Therefore, if the entityidentifier 202 includes an LEI and the action identifier 204 includes astring NFL, where the entity identifier 202 corresponds to the actionidentifier 204 in a one-to-many correspondence, then the item identifier206 can include a string FID, where the action identifier 204corresponds to the item identifier 206 in a one-to-many correspondence.

The category identifier 208 corresponds to a product that is associatedwith the item identifier 206. The item identifier 208 can be dependenton or hard coded to depend on the item identifier 206 as input. Forexample, in context of finance, the category identifier 208 can be aproduct identifier or product ID or PID or others. Therefore, if theentity identifier 202 includes an LEI and the action identifier 204includes a string NFL, where the entity identifier 202 corresponds tothe action identifier 204 in a one-to-many correspondence, and the itemidentifier 206 can include a string FID, where the action identifier 204corresponds to the item identifier 206 in a one-to-many correspondence,then the category identifier 208 can include a string PID, where theitem identifier 206 corresponds to the category identifier 208 in aone-to-many correspondence.

The type identifier 210 corresponds a document type that is associatedwith the category identifier 208 and a file that will be shared, asfurther explained below. The type identifier 210 can be dependent on orhard coded to depend on the category identifier 208. For example, incontext of finance, the type identifier 210 can be a string anInternational Swaps and Derivatives Association (ISDA) agreement orISDAA or others. Therefore, if the entity identifier 202 includes an LEIand the action identifier 204 includes a string NFL, where the entityidentifier 202 corresponds to the action identifier 204 in a one-to-manycorrespondence, and the item identifier 206 can include a string FID,where the action identifier 204 corresponds to the item identifier 206in a one-to-many correspondence, and the category identifier 208 caninclude a string PID, where the item identifier 206 corresponds to thecategory identifier 208 in a one-to-many correspondence, then the typeidentifier 210 can include a string ISDAA, where the category identifier208 corresponds to the type identifier 210 in a one-to-manycorrespondence.

The task identifier 212 corresponds to a task based on which a file willbe shared, as further described below. The task identifier 212 can begenerated based at least one of the entity identifier, the actionidentifier 204, or the item identifier 206. For example, in context offinance, the task identifier 212 can be a string a new fund launch 41 orNFL000041 or others. Therefore, if the entity identifier 202 includes anLEI and the action identifier 204 includes a string NFL, where theentity identifier 202 corresponds to the action identifier 204 in aone-to-many correspondence, and the item identifier 206 can include astring FID, where the action identifier 204 corresponds to the itemidentifier 206 in a one-to-many correspondence, and the categoryidentifier 208 can include a string PID, where the item identifier 206corresponds to the category identifier 208 in a one-to-manycorrespondence, and the type identifier 210 can include a string ISDAA,where the category identifier 208 corresponds to the type identifier 210in a one-to-many correspondence, then the task identifier 212 can beNFL000041 to which each of the entity identifier 202, the actionidentifier 204, and the item identifier 206 correspond in a many-to-onecorrespondence. For example, many entity identifiers 202 can correspondto the task identifier 212 NFL000041, many action identifiers 204 cancorrespond to the task identifier 212 NFL000041, and many itemidentifiers can correspond to the task identifier 212 NFL000041.

The document identifier 214 corresponds to a file that is being shared.The document identifier 214 can be generated based on a content of thefile, such as a document text or a pattern within the file, or acharacteristic of the file, such as a file name, a read or last-accessedor modified or created date or time stamp, a file size, or neither, suchas randomly, or others. For example, the document identifier 214 caninclude a string AK24!%asfLm@$1fa or others.

Therefore, if the entity identifier 202 includes an LEI and the actionidentifier 204 includes a string NFL, where the entity identifier 202corresponds to the action identifier 204 in a one-to-manycorrespondence, and the item identifier 206 can include a string FID,where the action identifier 204 corresponds to the item identifier 206in a one-to-many correspondence, and the category identifier 208 caninclude a string PID, where the item identifier 206 corresponds to thecategory identifier 208 in a one-to-many correspondence, and the typeidentifier 210 can include a string ISDAA, where the category identifier208 corresponds to the type identifier 210 in a one-to-manycorrespondence, and the task identifier 212 can be NFL000041 to whicheach of the entity identifier 202, the action identifier 204, and theitem identifier 206 correspond in a many-to-one correspondence, and thecategory identifier 208, then the document identifier 214AK24!%asfLm@$1fa can correspond to each of the entity identifier 202,the action identifier 204, the item identifier 206, the categoryidentifier 208, the type identifier 210, and the task identifier 212 ina many-to-one correspondence. For example, many document identifiers 214to the entity identifier 202, many document identifiers 214 cancorrespond to the action identifier 204, many document identifiers 214can correspond to the item identifier 206, many document identifiers 214can correspond to the category identifier 208, many document identifiers214 can correspond to the type identifier 210, and many documentidentifiers 214 can correspond to the task identifier 212.

FIG. 3 shows a flowchart of an embodiment of a process for grantingaccess to a copied file according to this disclosure. A process 300 isperformed via the network topology 100.

In block 302, the interface logic 126 presents a graphical userinterface (GUI) to the browser 118 over the network 102. The GUI depictsa set of input elements, such as a text field, a dropdown box, a radiobutton, a slider, or others. For example, the GUI can include a menu, aform, or questionnaire presented on at least one page, such as a webpageor others. The set of input elements are ready for user data entry, suchas via an input device, such as a mouse, a keyboard, whether physical orvirtual, a touchpad, a trackball, a camera, a microphone, or others. Theinterface logic 126 presents the GUI based on the client 104 sending theserver 110 a name and a password for authentication via the privilegelogic 138. For example, each of the name and the password can include analphanumeric string, a photo, a biometric, or others. As such, theserver 110 can host a session with the client 104 based on theapplication 122 communicating with the browser 118. Note that thesession can be a secure session, such as via an hypertext transferprotocol secure (HTTPS) protocol or others.

In block 304, the interface logic 126 receives a first entityidentifier, an action identifier, an item identifier, a categoryidentifier, a type identifier, and a copied file from the browser 118.With reference to FIG. 2 , the first entity identifier corresponds tothe entity identifier 202, the action identifier corresponds to theaction identifier 204, the item identifier corresponds to the itemidentifier 206, the category identifier corresponds to the categoryidentifier 208, and the type identifier corresponds to the typeidentifier 210. As such, the first entity identifier can correspond tothe action identifier in a one-to-many correspondence. Note that thesession between the browser 118 and the application 122 can beassociated with the first entity identifier and others, such as theaction identifier, the item identifier, the category identifier, orothers. For example, the browser 118 can login into the server 110 basedon a set of user credentials belonging to or corresponding to a usergroup associated with the first entity identifier, such as a first userwho can grant a permission for a file to a second user, where the firstuser is operating the browser 118, where the second user is associatedwith the first entity identifier or another entity identifier, where thepermission can include a read permission, a write permission, or others.However, note that the session between the browser 118 and theapplication 122 can be non-associated with the first user identifier.For example, the browser 118 can login into the server 110 based on aset of user credentials belonging to or corresponding to a user groupnon-associated with the first entity identifier where a user of thebrowser 118 acts as a 3rd party or matchmaker between a plurality ofentity identifiers inclusive of the first entity identifier. Forexample, in context of finance, this situation can occur between abroker (the first entity identifier) setting up an account between aclient of the broker and a settlement bank of the broker.

The copied file is received from the client 104, such as whether thefile was stored on the client 104 prior to copying or otherwiseaccessible to the client 104 or the browser 118, or from a data sourceremote from the client 104, such as via a network-based file sharingservice, whether P2P or cloud-based, such as Napster, BitTorrent,Dropbox, Box, Egnyte, Google Drive, Microsoft OneDrive, MicrosoftSharepoint, Microsoft Teams, Slack, Apple iCloud, and others. Forexample, the file can be stored local to the client 104 before copyingor remote from the client 104 before copying. For example, the copiedfile can be received from the browser 118 based on a user selection ofthe file prior to copying. For example, the copied file can be receivedfrom a data source, such as a network-based file sharing service, remotefrom the client 104 based on a user selection of the file, whetherlocally or remotely. Note that the copied file can be a data file, suchas a productivity document file, such as a Microsoft Word file, aMicrosoft Excel file, a Portable Document Format (PDF) file, an imagefile, a sound file, a plaintext file, a settings file, or others,whether password protected or not password protected. Likewise, notethat the copied file can be an executable file, such as a.BAT file,a.COM file, a.EXE file, a .BIN file, a smart contract file, or others,whether executable in a Windows environment or other OS environments,inclusive of distributed environments. Once received, the copied filecan be stored local to or remote from the server 110. For example, thecopied file can be stored via the database 146, as managed via thestorage logic 132. Note that the server 110 can check the copied filefor viruses or other malware when receiving the copied file. If theserver 110 detects the copied file to contain the virus, then the server110 can inform the client 104 of such and delete the copied file fromthe server 110.

In block 306, the metadata logic 136 generates a task identifier to beassociated with the first entity identifier, the action identifier, theitem identifier, and the category identifier. With respect to FIG. 2 ,the task identifier corresponds to the task identifier 212. For example,the task identifier can be generated based on the action identifier.Accordingly, the task identifier is associated with the first entityidentifier, the action identifier, the item identifier, and the categoryidentifier based on grouping the task identifier with the first entityidentifier in a one-to-many correspondence, the action identifier in aone-to-many correspondence, the item identifier in a one-to-manycorrespondence, and the category identifier in a one-to-manycorrespondence.

In block 308, the metadata logic 136 generates a document identifier forthe copied file. With respect to FIG. 2 , the document identifiercorresponds to the document identifier 214. As explained above, themetadata logic 136 can generate the document identifier based on thecontent of the copied file or the characteristic of the copied file orneither, such as randomly, or others.

In block 310, the metadata logic 136 populates a data structure suchthat the document identifier is mapped onto the first entity identifier,the action identifier, the item identifier, the category identifier, andthe type identifier. Note that the data structure can be preexisting atthat time or created at that time for use via the metadata logic 136.The metadata logic 136 can populate the data structure via writing intothe data structure, whether first-in-first-out (FIFO) orlast-in-first-out (LIFO) or others. For example, the documentidentifier, the first entity identifier, the action identifier, the itemidentifier, the category identifier, and the type identifier can bewritten into the data structure such that the document identifier ismapped onto the first entity identifier, the action identifier, the itemidentifier, the category identifier, and the type identifier. Forexample, the first entity identifier, the second entity identifier, andthe action identifier stored in the data structure can be or include ametadata tag. The data structure can include at least one of a table, aflat file, a vector, a tree, a linked list, a queue, a stack, a deque, amatrix, an array, a hash, a heap, a multi-map, a quad-tree, a graph, orothers. When the data structure includes a database, then the databasecan include a relational database, an in-memory database, a no-SQLdatabase, or others. As such, the data structure stores the documentidentifier mapped to each of the first entity identifier in aone-to-many correspondence, each of the action identifier in aone-to-many correspondence, each of the item identifier in a one-to-manycorrespondence, each of the category identifier in a one-to-manycorrespondence, and each of the type identifier in a one-to-manycorrespondence. For example, the data structure can be populated withthe task identifier such that the document identifier is mapped onto thetask identifier or such that the task identifier is mapped onto thedocument identifier.

Note that the data structure can be static or dynamic with respect to atleast one of a shape thereof or a size thereof. For example, when thedata structure includes a table, then the table includes a number ofcolumns and a number of rows. As such the number of columns or thenumber of rows can be static or dynamic. Likewise, the data structurecan store the first entity identifier, the action identifier, the itemidentifier, the category identifier, and the type identifier in at leastone of a predefined order or a predefined cell arrangement. For example,when the data structure includes a table, then the predefined order canmandate that entity identifiers sequentially precede action identifiersand action identifiers sequentially precede item identifiers or others.For example, when the data structure includes a table, then thepredefined cell arrangement can mandate that entity identifiers arepopulated in specified addressable cells (or columns or rows) and actionidentifiers are populated in specified addressable cells (or columns orrows). However, in some embodiments, the data structure does not storethe first entity identifier, the action identifier, the item identifier,the category identifier, and the type identifier in at least one of apredefined order or a predefined cell arrangement.

In block 312, the metadata logic 136 associates the task identifier withthe data structure. For example, such association can occur via groupingthe data structure with the task identifier. For example, suchassociation can occur via forming a hash table mapping the taskidentifier to the data structure, such as when the data structure has astructure identifier associated therewith and the mapping can occur viathe task identifier mapping onto the structure identifier. For example,such association can occur via writing the task identifier into the datastructure such that the task identifier is mapped onto the documentidentifier, such as in a one-to-many correspondence.

In block 314, the interface logic 126 enables the GUI presented via thebrowser 118 to input a second entity identifier. With reference to FIG.2 , the second entity identifier corresponds to the entity identifier202. Note that the second entity identifier can be identical to ordifferent from the first identifier. For example, the second entityidentifier can be identical to the first entity identifier, such as whensharing within a common user group, or different from the first entityidentifier, such as when sharing between different user groups. Forexample, the second entity identifier can be associated with the client106. Accordingly, since the menu presents the set of input elements thatare ready for user data entry, as explained above, the second entityidentifier can be input via an input device of the client 104, such as amouse, a keyboard, whether physical or virtual, a touchpad, a trackball,a camera, a microphone, or others. Note that, as explained above, thebrowser 118 can be associated with the first entity identifier (filesender) or a third entity identifier (matchmaker between two entityidentifiers). Also, note that at least one of the first entityidentifier or the second entity identifier can include a legal entityidentifier, whether those identifiers are identical to or different fromeach other in content, format, or others. Note that the task identifiercan be generated based on at least one of the first entity identifier orthe second entity identifier.

In block 316, the metadata logic 136 associates the task identifier withthe second entity identifier. For example, such association can occurvia grouping the second entity identifier with the task identifier.Likewise, for example, such association can occur via forming a hashtable mapping the task identifier to the second entity identifier.Similarly, for example, such association can occur via writing thesecond entity identifier into the data structure such that the documentidentifier is mapped onto the second entity identifier and the taskidentifier is mapped onto the document identifier. Note that the secondentity identifier can correspond to the action identifier in aone-to-many correspondence.

In block 318, the permission logic 142 shares the copied file with auser based on the second entity identifier via the task identifier. Theuser can be associated with the second entity identifier (and otheridentifiers disclosed herein) based on the user operating the browser120 of the client 106 and thereby hosting a session with the server 110.Note that the session can be a secure session, such as via a HTTPSprotocol or others. During the session, the user inputs the secondentity identifier (and other identifiers) into a GUI presented via thebrowser 120. The user can input the second entity identifier (and otheridentifiers) via an input device of the client 106, such as a mouse, akeyboard, whether physical or virtual, a touchpad, a trackball, acamera, a microphone, or others. For example, the GUI can include amenu, a form, a questionnaire, or others. Note that the GUI with whichthe user associated with the second entity identifier interfaces can beidentical to or different from or be same one as the GUI with which theuser associated with the first entity identifier interfaces.

Once the user is associated with the second entity identifier (and otheridentifiers disclosed herein) and the task identifier corresponds to thefirst entity identifier and the second entity identifier (and otheridentifiers disclosed herein), based on the task identifiercorresponding to the first identifier and the second identifier, thepermission logic 142 can share the copied file based on the documentidentifier. For example, the permission logic 142 can share the copiedfile via sending a message with a hyperlink from the user associatedwith the first entity identifier to the user associated with the secondentity identifier such that the user associated with the second entityidentifier can access the copied file via activating the hyperlink. Themessage can be sent and received via the messaging logic 128 and benotified of via the notification logic 144. When the link is activated,the server 110, such as via the storage logic 132, can access the taskidentifier corresponding to the first entity identifier and the secondentity identifier (and other identifiers disclosed herein), identify thedocument identifier corresponding to the task identifier, retrieve thecopied file from a repository based on the document identifier, andavail the copied file with the user associated with the second entityidentifier. As such, the copied file can be shared with the browser 120during the session via a presentation of a hyperlink on the browser 120,where the copied file is at least one of opened or downloaded based onan activation of the hyperlink via the browser 120 during the session.

Note that the message can include an email message, a text message, anover-the-top (OTT) message, a social networking message, or others.Further, note that the access can be a read right, a write right, orothers. Moreover, note that the browser 118 can be associated with thetask identifier during the session, such as via a cookie stored on theclient 106 or others, based on the user associated with the secondentity identifier providing an input into the browser 118, where theinput can include the entity identifier, the action identifier, the itemidentifier, the category identifier, or others, as explained above.Similarly, for example, where the user is associated with the secondentity identifier (and other identifiers), as explained above, and wherethe task identifier corresponds to the first entity identifier and thesecond entity identifier, based on the task identifier corresponding tothe first entity identifier and the second entity identifier, thepermission logic 142 can share the copied file via an icon correspondingto the copied file appearing within the GUI presented on the browser 120of the client 106, where the browser 120 is associated with the usercorresponding to the second entity identifier and where the copied filecan be accessed via activating the icon, such as via clicking, touching,or others. When the icon is activated, the server 110 can access thetask identifier corresponding to the first entity identifier and thesecond entity identifier (and other identifiers disclosed herein),identify the document identifier corresponding to the task identifier,retrieve the copied file from a repository based on the documentidentifier, and avail the copied file with the user associated with thesecond entity identifier. Therefore, the server 110 can associate thebrowser 120 with the task identifier during the session based on thesecond entity identifier being associated with the session, as userinput, and the action identifier being associated with the session, asuser input, matching the second entity identifier stored in the datastructure and the action identifier stored in the data structure, asexplained above. Note that the browser 120 can be associated with thetask identifier during the session based on the item identifier beingassociated with the session and the category identifier being associatedwith the session matching the item identifier in the data structure andthe category identifier in the data structure. Consequently, the server110 shares the copied file with the browser 120 during the session basedon the task identifier such that the copied file is retrievable via thebrowser 120 based on the document identifier stored in the datastructure. Note that the copied file can be shared with more than twoentity identifiers, such as at least three or more. For example, incontext of finance, this can involve an asset manager, a fundadministrator, and a custodian, as explained above. Further, note thatthe server 110 can deduplicate the copied file before sharing the copiedfile with the browser 120 during the session, as explained above. Forexample, the copied file can be deduplicated based on at least one ofthe first entity identifier, the second entity identifier, the actionidentifier, or the task identifier. For example, the copied file can bededuplicated based on at least the first entity identifier, the actionidentifier, and at least one of the task identifier or the second entityidentifier. For example, the copied file can be deduplicated based onthe first entity identifier, the action identifier, the task identifier,the second entity identifier, and at least one of the item identifier orthe category identifier.

In some embodiments, the server 110 includes a web server, anapplication server, and a database server. As explained above, the webserver serves the GUI on the browser 118 and receives the first entityidentifier, the second entity identifier, the action identifier, and thecopy. The application server generates the task identifier, the datastructure, and the document identifier. The application server groupsthe data structure with the task identifier. The application serverpopulates the data structure with the document identifier, the firstentity identifier, the second entity identifier, and the actionidentifier such that the document identifier maps onto the first entityidentifier, the second entity identifier, and the action identifier. Theweb server hosts the session with the browser 120 and the applicationserver associates the browser 120 with the task identifier during thesession based on the second entity identifier associated with thesession and the action identifier associated with the session matchingthe second entity identifier in the data structure and the actionidentifier in the data structure. The application server shares the copywith the browser 120 via the database server. The database server storesthe copy.

FIG. 4 shows a schematic diagram of an embodiment of a data structurestoring a document identifier and a plurality of tags according to thisdisclosure. A data structure 400 is presented as a table having aplurality of rows 402, 404, 406 and a plurality of columns 408, 410,412, 414, 416 thereby defining a grid with a plurality of addressablecells (fifteen as shown although more or less is possible). Each of theaddressable cells stores a metadata tag corresponding to an identifierdisclosed herein. As such, the row 402 stores a document identifier3981ak@!$sdjlaks, a tag 1 (a first entity identifier), a tag 2 (a secondentity identifier), a tag 3 (an action identifier). Note that the row402 includes an empty cell, which can be populated with a tag 4.Likewise, the row 404 includes a document identifier 43!5%#alksn, a tag1 (a first entity identifier), a tag 2 (a second entity identifier), atag 3 (an action identifier), a tag 4 (an item identifier). Note thatthe row 402 and the row 404 are different in an amount of populatedcells, although the row 402 and the row 404 may not differ in the amountof populated cells. As explained above, the data structure 400 can bestatic or dynamic with respect to at least one of a shape thereof or asize thereof. For example, the rows 402, 404, 406 or the columns 408,410, 412, 414, 416 can be static or dynamic in number. Likewise, thedata structure 400 can store a set of tags in at least one of apredefined order or a predefined cell arrangement. For example, thepredefined order can mandate that entity identifiers (tag 1 and tag 2)sequentially precede action identifiers (tag 3) and action identifiers(tag 3) sequentially precede item identifiers (tag 4) or others. Forexample, the predefined cell arrangement can mandate that entityidentifiers (tag 1 and tag 2) are populated in specified addressablecells (column 410 and column 412) and action identifiers are populatedin specified addressable cells (column 414). However, in someembodiments, the data structure 400 does not store a set of tags in atleast one of a predefined order or a predefined cell arrangement.

FIG. 5 shows a flowchart of an embodiment of a process for receivingaccess to a file according to this disclosure. A process 500 isperformed via the network topology 100.

In block 502, the interface logic 126 presents a GUI to a browser, asexplained above.

In block 504, the interface logic 126 receives a plurality ofidentifiers via the GUI, as explained above. The identifiers can includea first entity identifier, a second entity identifier, an actionidentifier, an item identifier, a category identifier, a typeidentifier, or others, as explained above.

In block 506, the permission logic 142 accesses a data structure, asexplained above. The data structure stores a document identifier, ametadata tag, and a mapping between the document identifier and themetadata tag, as explained above. The document identifier can be mappedto the metadata tag in a one-to-many correspondence, as explained above.The metadata tag includes information corresponding to at least one ofthe identifiers. For example, such information can be stored in analphanumeric format, a pictorial format, an audio format, barcodeformat, or any other symbolic or non-symbolic representation. The datastructure is already associated with a task identifier, as explainedabove. For example, such association can occur via the task identifierbeing stored within the data structure and mapped onto the documentidentifier in a one-to-many correspondence. For example, suchassociation can occur via the task identifier being an object storedexternal to the data structure and linked or related to the datastructure. As such, the data structure is accessed based on the taskidentifier, i.e., based on the identifiers received via the GUIcorresponding a plurality of identifiers pre-grouped with the taskidentifier.

In block 508, the search logic 140 searches the data structure for amatch between the tag and at least one of the identifiers, as input. Forexample, when the data structure stores a plurality of metadata tags andwhen the browser receives a first entity identifier, a second entityidentifier, an action identifier, an item identifier, a categoryidentifier, and a type identifier the search logic 140 searches the datastructure for the match between those identifiers and the tag. Thesearch logic 140 can employ at least one of a brute force searchalgorithm, a linear search algorithm, a binary search algorithm, a treesearch algorithm, a stochastic search algorithm a depth searchalgorithm, a breadth search algorithm, or others. The search logic 140can search for the match in parallel (concurrently search for matchesbetween the identifiers and the tags) or in series (sequentially searchfor matches between the identifiers and the tags).

In block 510, the search logic 140 identifies the match between the tagand at least one of the identifiers. For example, the match can beidentified between the tag and at least one of the first entityidentifier, the second entity identifier, the action identifier, thetask identifier, the item identifier, or the category identifier.

In block 512, the permission logic 142 accesses a set of rulesassociated with the tag, as matched to at least one of the identifiers.The set of rules corresponds to a predefined workflow associated withthat tag and to the task identifier corresponding to that tag. The setof rules can control how the GUI is presented to a user operating thebrowser. For example, the set of rules can control what output elementsare presented and content/logic therein or therebetween or what inputelements are presented and content/logic therein or therebetween. Forexample, the permission logic 142 can identify the set of rulescorresponding to the task identifier.

In block 514, the permission logic 142 interfaces with the storage logic132 such that the storage logic 132 retrieves a file corresponding tothe document identifier based on the mapping in the data structure. Forexample, the document identifier can be identified and the file isretrieved. The storage logic 132 retrieves the file from the database146. The file is retrieved via the document identifier based on thematch between the tag and at least one of the identifiers for a taskidentifier, i.e., once the match is identified then the documentidentifier corresponding to that tag is identified and the file isretrieved via the document identifier.

In block 516, the interface logic 126 presents the GUI via the browserbased on the set of rules. As such, the GUI can be regenerated ormodified based on the set of rules. For example, various input elementsand output elements are presented based on the set of rules and variouscorresponding content/logic is presented or coupled to the various inputelements and the output elements.

In block 518, the interface logic 126 communicates with the permissionlogic 142 such that the file is availed via the GUI based on the set ofrules, as explained above. For example, the permission logic 142 canshare the file via presenting a message with a hyperlink such that thefile can be accessed via activating the hyperlink or via an iconcorresponding to the file appearing within the GUI and where the filecan be accessed via activating the icon, such as via clicking, touching,or others.

FIGS. 6A-6C show a flowchart and a pair of screenshots of an embodimentof a technique for tracking a progress against a set of rules based on afile associated with a plurality of item identifiers, a plurality ofcategory identifiers, and a plurality of type identifiers according tothis disclosure. A process 600A is performed via the network topology100.

In block 602, the interface logic 126 presents a GUI 600B, 600C based ona task identifier, as previously formed based on a plurality ofidentifiers previously input via a user of a browser, as explainedabove. The identifiers include an entity identifier, an actionidentifier, a plurality of item identifiers, a plurality of categoryidentifiers, or others. The GUI 600B, 600C depicts a first pagehyperlink 612 and a second page hyperlink 614, as selectively switchabletherebetween.

In block 604, the interface logic 126 populates the GUI 600B, 600C witha plurality of strings based on the entity identifier, the actionidentifier, the item identifiers, and the category identifiers. Thestrings correspond to the entity identifier, the action identifier, theitem identifier, and the category identifier. For example, the stringscan be labels, whether passive or active (hyperlinked), to aid in userinteractivity.

In block 606, the interface logic 126 communicates with the metadatalogic 136 and the progress logic 138 such that the GUI 600B presents atabular menu 610 based on the item identifiers and the categoryidentifiers when the first page hyperlink 612 is selected. The tabularmenu 610 includes a plurality of columns and a plurality of rows therebydefining a grid containing a plurality of values corresponding to theitem identifiers and the category identifiers with respect to aplurality of files stored in the database 146. In the tabular menu 610,the rows correspond to the item identifiers and the columns correspondto the category identifiers, a plurality of type identifiers, and otheridentifiers, as previously input, as explained above.

The tabular menu 610 also presents a checkbox based grid 616corresponding to the item identifiers with respect the files satisfyinga present or absence threshold (binary) based on the set of rules, asexplained above. Note that the set of rules corresponds to the taskidentifier, as explained above. Also, note that the checkbox based grid616 includes a pause button and a play button for each of the itemidentifiers, with the pause button pausing a progress analysis againstthat respective item identifier and the play button maintaining aprogress analysis active against that respective item identifier. Assuch, for each of the item identifiers, as the files get uploaded andtagged, as explained above, the checkbox based grid 616 gets completed,as determined against the set of rules. In some embodiments, thecheckbox based grid 616 can be manually updated via the browser 118 orthe browser 120 in real-time so that the checkbox based grid 616 isvisually updated to at least one of the browser 118 or the browser 120.

Note that the GUI 600B, 600C depicts a pie bar 620 which is dynamicallyupdated in real-time based on the checkbox based grid 616 beingcompleted. Note that the pie bar 620 is associated with the taskidentifier.

Further, note that the GUI 600B, 600C contains a messaging interface622, as managed via the messaging logic 128 based on the taskidentifier. For example, the messaging interface 622 enables internalmessaging communications between the browser 118 and the browser 120based on the task identifier between the user associated with the firstentity identifier and the user associated with the second entityidentifier, as grouped with the task identifier. As such, the messaginglogic 128 enables an internal messaging service between the browser 118and the browser 120 during a session based on the task identifier aftera copied file has been shared with the browser 120 during the session,as explained above. In some embodiments, the messaging interface 622enables external messaging communications between the browser 118 andthe browser 120 are possible.

The second page hyperlink 614 presents a tabular menu 618 that showsvarious category identifiers and type identifiers corresponding to thefiles, as uploaded and categorized with the type identifier, and not yetuploaded, as explained above. Note that the tabular menu 610 and thecheckbox based grid 6161 are based on values of the tabular menu 618.

In block 608, the interface logic 126 communicates with the metadatalogic 136 and the progress logic 138 such that the GUI 600B updates thetabular menu 610 with respect to the item identifiers based on thecategory identifiers and the type identifiers. For example, as the filesget uploaded via the GUI 600C, the checkbox based grid 616 gets updatedbased on the set of rules corresponding to the task identifier.Therefore, the pie bar 620 is updated accordingly. As such, the server110 can monitor a status of a degree of completion of a document setbased on the set of rules and present the tabular menu 610 to thebrowser 118 or the browser 120 after sharing of the copied file with thebrowser 120 during the session, where the tabular menu 610 is configuredto depict the status of the degree of completion of the document setwith respect to the item identifier and the category identifier based onthe set of rules.

FIGS. 7A-7C show a flowchart and a pair of screenshots of an embodimentof a technique for updating a progress detail according to thisdisclosure. A process 700A is performed via the network topology 100.

In block 702, the interface logic 126 presents a GUI 700B, 700C based ona task identifier, as previously formed based on a plurality ofidentifiers previously input via a user of a browser, as explainedabove. The identifiers include an entity identifier, an actionidentifier, a plurality of item identifiers, a plurality of categoryidentifiers, or others. The GUI 700B, 700C is similar to the GUI 600B,600C except for a lower part 710 thereof. The lower part 710 includes afirst page hyperlink 712 and a second page hyperlink 714, as selectivelyswitchable therebetween.

In block 704, the interface logic 126 populates the GUI 700B, 700C witha plurality of strings based on the entity identifier, the actionidentifier, the item identifiers, and the category identifiers. Thestrings correspond to the entity identifier, the action identifier, theitem identifier, and the category identifier. For example, the stringscan be labels, whether passive or active (hyperlinked) to aid in userinteractivity.

In block 706, the interface logic 126 communicates with the metadatalogic 136 such that the GUI 700B, 700C presents (1) a tabular menu onthe GUI 700B based on a plurality of type identifiers associated withthe item identifiers and the category identifiers when the first pagehyperlink 712 is selected and (2) a tabular menu on the GUI 700C whenthe second page hyperlink 714 is selected. Note that the tabular menu ofthe GUI 700B and the tabular menu of the GUI 700C are dynamically linkedbetween each other so that an update in one can update in the other.

The tabular menu associated with the first page hyperlink 712 operatesas a progress task list and enables a user input to select a checkboxcorresponding to a type identifier associated with that particular itemidentifier and that particular category identifier, as compared againstthe set of rules, as explained above. The tabular menu associated withthe second page hyperlink 714 operates as a document listing and enablesa user to see a document type corresponding to a particular file for aparticular item identifier and a particular category identifier and alsosee various document related information, such as file upload time/date,entity identifier associated with file upload, file comments, filedownload link, and others.

In block 708, the interface logic 126 communicates with the metadatalogic 136 such that the GUI 700B, 700C updates the tabular menuassociated with the first page hyperlink 712 or the tabular menuassociated with the second page hyperlink 714 with respect to the taskidentifier based on a user input into at least one of the first pagehyperlink 712 or the tabular menu associated with the second pagehyperlink 714, with the input being associated with the type identifier.

FIG. 8 shows a flowchart of an embodiment of a process for appending toa blockchain according to this disclosure. A process 800 is performedvia the network topology 100.

In block 802, the metadata logic 136 communicates with the interfacelogic 126 such that the metadata logic 136 receives a plurality ofidentifiers and a copied file from a browser of a client, as explainedabove. For example, the identifiers can include an entity identifier, anaction identifier, a plurality of item identifiers, a plurality ofcategory identifiers, or others.

In block 804, the metadata logic 136 generates a document identifier forthe copied file, as explained above.

In block 806, the metadata logic 136 writes the document identifier intoa data structure, as explained above.

In block 808, the metadata logic 136 writes the identifiers into a datastructure, as explained above.

In block 810, the metadata logic 136 forms a mapping between thedocument identifier and the identifiers in the data structure, asexplained above.

In block 812, the metadata logic 136 communicates with the blockchainlogic 124 such that the blockchain logic 124 inserts a block into ablockchain, which can correspond to the mapping. The blockchain can belocal to or remote from the server 110. The blockchain logic 124 canform the block based on the mapping as the blockchain logic 124 readsthe data structure. For example, the block can inform of the documentidentifier mapping onto the identifiers, where the document identifierhas a one-to-many correspondence to each of the identifiers, asexplained above. In some embodiments, the block can be informative ofthe task identifier corresponding to the data structure or the taskidentifier corresponding to the document identifier in the datastructure or any other logical relationship involving the identifiers orthe data structure. For example, the block can be created based on amapping between the document identifier and a group, wherein the groupincludes at least one of the first entity identifier, the actionidentifier, the task identifier, or the second entity identifier.

In block 814, the blockchain logic 124 reads the block in theblockchain.

In block 816, the blockchain logic 124 can communicate with any logiclocal to or remote from the server 110 to take an action, whether thelogic is hardware-based or software-based. For example, the action caninclude reading data, writing data, selecting data, deleting data,formatting data, sending or receiving a message to a client or a datasource, whether local or remote from the server 110, communicating withan input device or an output device, whether local or remote from theserver 110, or others.

FIG. 9 shows a flowchart of an embodiment of a process for executing asmart contract based on a data structuring according to this disclosure.A process 900 is performed via the network topology 100.

In block 902, the blockchain logic 124 accesses a smart contract logic,whether local to or remote from the server 110. For example, the smartcontract logic can include an Ethereum platform logic. For example, thesmart contract logic can include various executable code, such asfunctions, objects, or others, stored in a data structure, such as afile or others, whether including any identifiers, as explained above,or excluding any identifiers, as explained above.

In block 904, the blockchain logic 124 couples the smart contract logicto a data structure storing a document identifier, a tag, and a mappingbetween the document identifier and the tag, which can include aone-to-many correspondence. Such coupling can include the blockchainlogic 124 interfacing with the permission logic 124 to grant a readaccess to the data structure storing the document identifier, the tag,and the mapping or the blockchain logic 124 interfacing with thepermission logic 124 to upload the data structure storing the documentidentifier, the tag, and the mapping from the server 110 onto anotherserver, or another operative way to enable the smart contract logic toact based on a content of the data structure or a grouping associatedwith the data structure, such as when the task identifier is groupedwith the data structure. Note that the data structure storing thedocument identifier, the tag, and the mapping can be stored local to orremote from the server 110.

In block 904, the blockchain logic 124 causes the smart contract logicto execute based on the data structure, such as a content of the datastructure. For example, the blockchain logic 124 can authorize orrequest execution or not deny the read access for the data structure tothe smart contract logic.

FIG. 10 shows a flowchart of an embodiment of a process for reading adata structuring via an artificial intelligence (AI) process accordingto this disclosure. A process 1000 is performed via the network topology100.

In block 1002, the application 122 accesses a data structure storing adocument identifier, a tag, and a mapping between the identifier and thetag, as explained above.

In block 1004, the application 122 employs an artificial intelligenceprocess to read the data structure such that the application 122determines a population pattern, a storage pattern, an organizationalpattern, a date/timing pattern, a sequence pattern, a tag pattern, atask pattern, an action patter, an item pattern, a category pattern, aproduct pattern, a type pattern, an identifier pattern, or any otherpattern or classification or lack of any thereof within the datastructure based on a content of the data structure. For example, theartificial intelligence process can employ machine learning, imageprocessing, text analysis, querying of a remote data source, or others,whether local to or remote from the server 110, inclusive of anycloud-based or distributed environments.

In block 1006, the application 122 takes an action or cause anotherlogic entity to take an action, whether the entity is hardware orsoftware based. For example, the action can include reading data,writing data, selecting data, deleting data, formatting data, sending orreceiving a message to a client or a data source, whether local orremote from the server 110, communicating with an input device or anoutput device, whether local or remote from the server 110, or others.

FIG. 11 shows a flowchart of an embodiment of a process for a useraction with respect to a data structure based on a belonging to a usergroup according to this disclosure. A process 1100 is performed via thenetwork topology 100.

In block 1102, the privilege logic 138 authenticates a user based on theuser operating a browser hosting a session with the server 110, asexplained above. Note that, during the session, the user is associatedwith a user identifier hierarchically positioned under or related to anentity identifier, as explained above. For example, the entityidentifier can have a plurality of user identifiers hierarchicallyassociated therewith.

In block 1104, the privilege logic 138 interfaces with the metadatalogic 136 to identify a user group to which the user belongs based onthe user identifier. The user group corresponds to the task identifier,as explained above. For example, this identification can occur viaidentifying the task identifier associated with the entity identifier towhich the user identifier is related or vice versa. For example, thiscan occur via the task identifier being associated with the entityidentifier and, since the entity identifier can have a plurality of useridentifiers associated therewith, the user identifier can be looked upagainst the user identifiers associated with the entity identifier forthat task identifier. Note that the user identifier can be associatedwith a plurality of task identifiers simultaneously. As such, the usergroup to which the user belongs can be identified.

In block 1106, the permission logic 142 interfaces with the metadatalogic 136 to enable the user to act with respect to a data structurestoring a document identifier, a tag, and a mapping between the documentidentifier and the tag based on the group, as explained above. As such,once the user group has been identified, the user can access a filebased on the document identifier associated with the task identifier forthe user group to which the user belongs and then access the file basedon the document identifier, as explained above.

FIGS. 12-22 show a plurality of screenshots of an embodiment of a userinterface operating based on a data structure storing a mapping betweena document identifier and a plurality of tags according to thisdisclosure.

FIG. 12 shows a GUI 1200 which, as explained above, tabularly displays agrid containing a task identifier column listing a plurality of taskidentifiers (hyperlinkable), a first entity identifier column listing aplurality of first entity identifiers for the task identifiers, a secondentity identifier column listing a plurality of second entityidentifiers for the task identifiers, an action required identifiercolumn listing a plurality of action identifiers (binarily-presentedstars) based on a type identifier and a set of rules for the taskidentifiers, and an age identifier column listing a plurality of ageidentifiers based on a set of rules for the task identifiers (as trackedvia data structures).

FIG. 13 shows a GUI 1300, which as explained above, presents thecheckbox based grid 616, as explained above. Note that for the itemidentifier (2172), the category identifiers (USD Repos and Non-USDRepos) are complete, as indicated by checked checkboxes that are alsomade visually distinct. In contrast, other category identifiers are notchecked to be completed. Also, note that some category identifiers(equity swaps) are paused, as indicated by a visually distinct icon.

FIG. 14 shows a GUI 1400, which as explained above, via the export logic130, enables a user to export a data structure with a documentidentifier, a tag, and a mapping between the document identifier and themapping to another server. For example, the data structure storing thedocument identifier, the first entity identifier, the second entityidentifier, and the action identifier is exportable as a data file, suchas a comma- separated-value file, a flat file, or others.

FIG. 15 shows a GUI 1500, which as explained above, via the progresslogic 138, enables tracking of a plurality of workflows associated witha plurality of entity identifiers based on a plurality of taskidentifiers. The workflows corresponds to a plurality of histogramscorresponding to the entity identifiers and track which documents arepast due or coming due or OK, as measured against a set of rules,whether for a particular task identifier or entity identifier, asexplained above. For example, the set of rules can include a targetdocument upload date which can be input via the browser 118 or thebrowser 120, as explained above.

FIG. 16 shows a GUI 1600, which as explained above, via the progresslogic 138 enables a more granular document tracking with respect to theGUI 1500. As shown, this type of tracking can be based on entityidentifiers for specific time periods, as measured against a set ofrules, whether for a particular task identifier or entity identifier, asexplained above.

FIG. 17 shows a GUI 1700, which as explained above, via the progresslogic 138, enables even more granular document tracking with respect tothe GUI 1600. Here, the GUI 1700 depicts average task completion timefor a particular identifier with respect to various workflows, asmeasured against a set of rules, whether for a particular taskidentifier or entity identifier, as explained above.

FIG. 18 shows a GUI 1800, which as explained above, via the progresslogic 138, enables tracking of documents that are received or missingfor an entity identifier and an action identifier based on a pluralityof hyperlinked task identifiers and a plurality of entity identifiers(grouped by task identifiers).

FIG. 19 shows a GUI 1900, which as explained above, enables a moregranular view of the GUI 1800 and shows with particularity what happenswhen one of the hyperlinked task identifiers is activated, i.e., a tableshowing a plurality of document type identifiers, a plurality of filenames, and a plurality of file upload icons, where items are completeand some are incomplete.

FIG. 20 shows a GUI 2000, which as explained above, shows a tabular viewof a plurality of hyperlinked item identifiers and a plurality ofcategory identifiers (grouped by item identifiers) for an entityidentifier and an action identifier.

FIG. 21 shows a GUI 2100, which as explained above, shows a listing ofentity identifiers (Legal & General) associated with a task identifier(LGIM EMEA New Fund Launch).

FIG. 22 shows a GUI 2200, which as explained above, shows a listing offile names and document types for a task identifier of the GUI 2100.

FIGS. 23A-23I show a plurality of screenshots of an embodiment of amulti- user sharing technique according to this disclosure. Inparticular, a GUI 2300, as explained above, shows a multi-pagequestionnaire involving a workflow with a plurality of users associatedwith different entity identifiers. Upon competition of the multi-pagequestionnaire, a set of rules is formed against which the workflow isevaluated based on files, as uploaded, and compared via a datastructure, as explained above. The GUI then presents various tabularmenus, which enable document tracking, progress monitoring, andinter-user messaging based on various identifiers, as explained above.In some embodiments, the GUI 2300 is configured to provide a templatefile for download, where a user downloads the template file, populatesthe template file as mandated, and uploads the template file aspopulated. The template file gets validated and once validated can getgrouped with a task identifier, as explained above. For example, suchgrouping can be performed based on identifiers as present in thetemplate file.

In addition, features described with respect to certain exampleembodiments may be combined in or with various other example embodimentsin any permutational or combinatory manner. Different aspects orelements of example embodiments, as disclosed herein, may be combined ina similar manner. The term “combination”, “combinatory,” or“combinations thereof” as used herein refers to all permutations andcombinations of the listed items preceding the term. For example, “A, B,C, or combinations thereof” is intended to include at least one of: A,B, C, AB, AC, BC, or ABC, and if order is important in a particularcontext, also BA, CA, CB, CBA, BCA, ACB, BAC, or CAB. Continuing withthis example, expressly included are combinations that contain repeatsof one or more item or term, such as BB, AAA, AB, BBC, AAABCCCC, CBBAAA,CABABB, and so forth. The skilled artisan will understand that typicallythere is no limit on the number of items or terms in any combination,unless otherwise apparent from the context.

Various embodiments of the present disclosure may be implemented in adata processing system suitable for storing and/or executing programcode that includes at least one processor coupled directly or indirectlyto memory elements through a system bus. The memory elements include,for instance, local memory employed during actual execution of theprogram code, bulk storage, and cache memory which provide temporarystorage of at least some program code in order to reduce the number oftimes code must be retrieved from bulk storage during execution.

I/O devices (including, but not limited to, keyboards, displays,pointing devices, DASD, tape, CDs, DVDs, thumb drives and other memorymedia, etc.) can be coupled to the system either directly or throughintervening I/O controllers. Network adapters may also be coupled to thesystem to enable the data processing system to become coupled to otherdata processing systems or remote printers or storage devices throughintervening private or public networks. Modems, cable modems, andEthernet cards are just a few of the available types of networkadapters.

The present disclosure may be embodied in a system, a method, and/or acomputer program product. The computer program product may include acomputer readable storage medium (or media) having computer readableprogram instructions thereon for causing a processor to carry outaspects of the present disclosure. The computer readable storage mediumcan be a tangible device that can retain and store instructions for useby an instruction execution device. The computer readable storage mediummay be, for example, but is not limited to, an electronic storagedevice, a magnetic storage device, an optical storage device, anelectromagnetic storage device, a semiconductor storage device, or anysuitable combination of the foregoing. A non- exhaustive list of morespecific examples of the computer readable storage medium includes thefollowing: a portable computer diskette, a hard disk, a random accessmemory (RAM), a read-only memory (ROM), an erasable programmableread-only memory (EPROM or Flash memory), a static random access memory(SRAM), a portable compact disc read-only memory (CD-ROM), a digitalversatile disk (DVD), a memory stick, a floppy disk, a mechanicallyencoded device such as punch-cards or raised structures in a groovehaving instructions recorded thereon, and any suitable combination ofthe foregoing.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present disclosure may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. A code segment ormachine-executable instructions may represent a procedure, a function, asubprogram, a program, a routine, a subroutine, a module, a softwarepackage, a class, or any combination of instructions, data structures,or program statements. A code segment may be coupled to another codesegment or a hardware circuit by passing and/or receiving information,data, arguments, parameters, or memory contents. Information, arguments,parameters, data, etc. may be passed, forwarded, or transmitted via anysuitable means including memory sharing, message passing, token passing,network transmission, among others. The computer readable programinstructions may execute entirely on the user's computer, partly on theuser's computer, as a stand-alone software package, partly on the user'scomputer and partly on a remote computer or entirely on the remotecomputer or server. In the latter scenario, the remote computer may beconnected to the user's computer through any type of network, includinga local area network (LAN) or a wide area network (WAN), or theconnection may be made to an external computer (for example, through theInternet using an Internet Service Provider). In some embodiments,electronic circuitry including, for example, programmable logiccircuitry, field-programmable gate arrays (FPGA), or programmable logicarrays (PLA) may execute the computer readable program instructions byutilizing state information of the computer readable programinstructions to personalize the electronic circuitry, in order toperform aspects of the present disclosure.

Aspects of the present disclosure are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of thedisclosure. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions. The various illustrative logicalblocks, modules, circuits, and algorithm steps described in connectionwith the embodiments disclosed herein may be implemented as electronichardware, computer software, or combinations of both. To clearlyillustrate this interchangeability of hardware and software, variousillustrative components, blocks, modules, circuits, and steps have beendescribed above generally in terms of their functionality. Whether suchfunctionality is implemented as hardware or software depends upon theparticular application and design constraints imposed on the overallsystem. Skilled artisans may implement the described functionality invarying ways for each particular application, but such implementationdecisions should not be interpreted as causing a departure from thescope of the present disclosure.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present disclosure. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

Words such as “then,” “next,” etc. are not intended to limit the orderof the steps; these words are simply used to guide the reader throughthe description of the methods. Although process flow diagrams maydescribe the operations as a sequential process, many of the operationscan be performed in parallel or concurrently. In addition, the order ofthe operations may be re-arranged. A process may correspond to a method,a function, a procedure, a subroutine, a subprogram, etc. When a processcorresponds to a function, its termination may correspond to a return ofthe function to the calling function or the main function.

Features or functionality described with respect to certain exampleembodiments may be combined and sub-combined in and/or with variousother example embodiments. Also, different aspects and/or elements ofexample embodiments, as disclosed herein, may be combined andsub-combined in a similar manner as well. Further, some exampleembodiments, whether individually and/or collectively, may be componentsof a larger system, wherein other procedures may take precedence overand/or otherwise modify their application. Additionally, a number ofsteps may be required before, after, and/or concurrently with exampleembodiments, as disclosed herein. Note that any and/or all methodsand/or processes, at least as disclosed herein, can be at leastpartially performed via at least one entity or actor in any manner.

Although preferred embodiments have been depicted and described indetail herein, skilled artisans know that various modifications,additions, substitutions and the like can be made without departing fromspirit of this disclosure. As such, these are considered to be withinthe scope of the disclosure, as defined in the following claims.

What is claimed is:
 1. A system comprising: a plurality of servers iscollectively programmed to: receive a first legal entity identifier(LEI), a second LEI, and an action identifier from a first client;receive a copy of a file selected via the first client; generate a taskidentifier, a data structure, and a document identifier; group the datastructure with the task identifier; populate the data structure with thedocument identifier, the first LEI, the second LEI, and the actionidentifier such that the document identifier (1) maps onto the firstLEI, the second LEI, and the action identifier and (2) is associatedwith the copy; host a session with a second client, wherein the sessionis associated with the second LEI and the action identifier; associatethe second client with the task identifier during the session based onthe second LEI associated with the session and the action identifierassociated with the session matching the second LEI in the datastructure and the action identifier in the data structure; and share thecopy with the second client during the session based on the taskidentifier such that the copy is retrievable via the second client basedon the document identifier in the data structure, wherein the copy isshared with the second client during the session based on the taskidentifier.
 2. The system of claim 1, wherein the first client isassociated with the first LEI.
 3. The system of claim 1, wherein thefirst client is associated with a third LEI other than the first LEI andthe second LEI.
 4. The system of claim 1, wherein the copy is sharedwith the second client during the session via a presentation of ahyperlink on the second client, wherein the copy is at least one ofopened or downloaded based on an activation of the hyperlink via thesecond client during the session.
 5. The system of claim 1, wherein thefirst LEI is identical to the second LEI in value.
 6. The system ofclaim 1, wherein the first LEI is different from the second LEI invalue.
 7. The system of claim 1, wherein the copy includes a content,wherein the document identifier is generated based on the content. 8.The system of claim 1, wherein the copy includes a characteristic,wherein the document identifier is generated based on thecharacteristic.
 9. The system of claim 1, wherein the plurality ofservers is collectively programmed to populate the data structure withthe task identifier such that the document identifier is mapped onto thetask identifier.
 10. The system of claim 1, wherein the file is storedremote from the first client.
 11. The system of claim 1, wherein theplurality of servers is collectively programmed to: receive an itemidentifier and a category identifier from the first client; populate thedata structure with the item identifier and the category identifier suchthat the document identifier maps onto the item identifier and thecategory identifier, wherein the session is associated with the itemidentifier and the category identifier; and associate the second clientwith the task identifier during the session based on the item identifierassociated with the session and the category identifier associated withthe session matching the item identifier in the data structure and thecategory identifier in the data structure.
 12. The system of claim 11,wherein the action identifier corresponds to the item identifier in aone-to-many correspondence.
 13. The system of claim 11, wherein the itemidentifier corresponds to the category identifier in a one-to-manycorrespondence.
 14. The system of claim 11, wherein the first LEIcorresponds to the action identifier in a one-to-many correspondence.15. The system of claim 11, wherein the second LEI corresponds to theaction identifier in a one-to-many correspondence.
 16. The system ofclaim 11, wherein the task identifier corresponds to the documentidentifier in a one-to-many correspondence.
 17. The system of claim 1,wherein the first LEI corresponds to the action identifier in aone-to-many correspondence.
 18. The system of claim 1, wherein thesecond LEI corresponds to the action identifier in a one-to-manycorrespondence.
 19. The system of claim 1, wherein the task identifiercorresponds to the document identifier in a one-to-many correspondence.20. The system of claim 1, wherein the task identifier is generatedbased on at least one of the first LEI or the second LEI.
 21. The systemof claim 1, wherein the task identifier is generated based on the actionidentifier.
 22. The system of claim 1, wherein the first client includesa first messaging interface, wherein the second client includes a secondmessaging interface, wherein the plurality of servers is collectivelyprogrammed to enable an internal messaging service between the firstclient and the second client during the session based on the taskidentifier after the copy has been shared with the second client duringthe session.
 23. The system of claim 1, wherein the data structurestores an item identifier and a category identifier such that thedocument identifier maps onto the item identifier and the categoryidentifier, wherein the plurality of servers is collectively programmedto: identify a set of rules corresponding to the task identifier;monitor a status of a degree of completion of a document set based onthe set of rules; and present a menu to the first client and the secondclient after sharing of the copy with the second client during thesession, wherein the menu is programmed to depict the status of thedegree of completion of the document set with respect to the itemidentifier and the category identifier based on the set of rules. 24.The system of claim 1, wherein the plurality of servers is collectivelyprogrammed to: receive an input from the second client during thesession; search the data structure for a match based on the input;identify the match between the input and at least one of the first LEI,the second LEI, the action identifier, or the task identifier; identifythe document identifier based on the match; and share the copy with thesecond client during the session based on the document identifier. 25.The system of claim 24, wherein the data structure stores an itemidentifier and a category identifier such that the document identifiermaps onto the item identifier and the category identifier, wherein thematch is identified between the input and at least one of the first LEI,the second LEI, the action identifier, the task identifier, the itemidentifier, or the category identifier.